Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

We consider the single machine parallel-batching scheduling problem with precedence relations, release dates and identical processing times to minimize a regular objective function. When the processing times are unit, we give an O(n) time optimal algorithm. When there are no precedence relations, we solve this problem by dynamic programming in O(n) time. When the precedence relations are “layer...

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O n n m + 1 m time dynamic programming algorithm and an O(mk k P 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of di...

Identical parallel machine scheduling with time-dependent processing times

In the literature, most of the parallel-machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study a parallel-machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objectives are to minimize the total completion of all jobs and the total ...